Timing-Constrained Congestion-Driven Global Routing

نویسندگان

  • Jin-Tai Yan
  • Shun-Hua Lin
چکیده

It is well known that congestion control becomes more and more important in modern grid-based routing process. In this paper, a timing-constrained congestion-driven global routing approach is proposed to obtain initial congestion-driven global routing result without destroying the timing constraint of any routing net, and a post-processing simulated-annealingbased rip-up-and-reroute improvement is proposed to release the congestion of the grid edges. As mentioned in experimental results, the proposed TCGR+STRR algorithm can obtain near 100% global routability in congestion control for the tested benchmark circuits.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A timing-constrained simultaneous global routing algorithm

Proposed in this paper is a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. The authors’ approach provides a general framework that may use any single-net routing algorithm and any delay model in global routing. It is based on the observation that there are several routing topology flexibilities that can be exp...

متن کامل

Performance Driven Global Routing Through Gradual Re nement

We propose a heuristic for VLSI interconnect global routing that can optimize routing congestion delay and number of bends which are often competing objectives Routing exibilities under timing constraints are obtained and exploited to reduce congestion subject to timing constraints The wire routes are determined through gradual re nement according to probabilistic estimation on congestions so t...

متن کامل

Multilevel global placement with congestion control

In this paper, we develop a multilevel global placement algorithm (MGP) integrated with fast incremental global routing for directly updating and optimizing congestion cost during physical hierarchy generation. Fast global routing is achieved using a fast two-bend routing and incremental A-tree algorithm. The routing congestion is modeled by the wire usage estimated by the fast global router. A...

متن کامل

Advanced operations research techniques for multi-constraint QoS routing in internet

Internet Traffic has grown exponentially over last few years due to provision of multiple class services through Internet backbone. With the explosive use of Internet, contemporary Internet routers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. In this paper, an analysis is made how forecasting technique, routing algorithm and Genetic...

متن کامل

FastRoute: An Efficient and High-Quality Global Router

Modern large-scale circuit designs have created great demand for fast and high-quality global routing algorithms to resolve the routing congestion at the global level. Rip-up and reroute scheme has been employed by the majority of academic and industrial global routers today, which iteratively resolve the congestion by recreating the routing path based on current congestion. This method is prov...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003